منابع مشابه
Random Sampling of Plane Partitions
This article presents uniform random generators of plane partitions according to the size (the number of cubes in the 3D interpretation). Combining a bijection of Pak with the method of Boltzmann sampling, we obtain random samplers that are slightly superlinear: the complexity is O(n(lnn)3) in approximate-size sampling and O(n4/3) in exact-size sampling (under a real-arithmetic computation mode...
متن کاملPlane Partitions
Throughout our study of the enumeration of plane partitions we make use of bijective proofs to find generating functions. In particular, we consider bounded plane partitions, symmetric plane partitions and weak reverse plane partitions. Using the combinatorial interpretations of Schur functions in relation to semistandard Young tableaux, we rely on the properties of symmetric functions. In our ...
متن کاملSymmetries of plane partitions
We introduce a new symmetry operation, called complementation, on plane partitions whose three-dimensional diagram is contained in a given box. This operation was suggested by work of Mills, Robbins, and Rumsey. There then arise a total of ten inequivalent problems concerned with the enumeration of plane partitions with a given symmetry. Four of these ten problems had been previously considered...
متن کاملSubwords and Plane Partitions
Using the powerful machinery available for reduced words of type B, we demonstrate a bijection between centrally symmetric k-triangulations of a 2(n + k)-gon and plane partitions of height at most k in a square of size n. This bijection can be viewed as the type B analogue of a bijection for k-triangulations due to L. Serrano and C. Stump. Résumé. En utilisant la machinerie puissante pour mots ...
متن کاملArithmetic Properties of Plane Partitions
The 2-adic valuations of sequences counting the number of alternating sign matrices of size n and the number of totally symmetric plane partitions are shown to be related in a simple manner.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorics, Probability and Computing
سال: 2009
ISSN: 0963-5483,1469-2163
DOI: 10.1017/s0963548309990332